Heavy Points of a d-dimensional Simple Random Walk
نویسندگان
چکیده
For a simple symmetric random walk in dimension d ≥ 3, a uniform strong law of large numbers is proved for the number of sites with given local time up to time n. AMS 2000 Subject Classification: Primary 60G50; Secondary 60F15, 60J55.
منابع مشابه
On the behavior of random walk around heavy points
Consider a symmetric aperiodic random walk in Z, d ≥ 3. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show that they converge to a deterministic limit as the number of steps tends to infinity. AMS 2000 Subject Classification: Primary 60G50; Secondary 60F15, 60J55.
متن کاملMaximal Local Time of a d-dimensional Simple Random Walk on Subsets
Strong theorems are given for the maximal local time on balls and subspaces for the d-dimensional simple symmetric random walk. AMS 2000 Subject Classification: Primary 60J15; Secondary 60F15, 60J55.
متن کاملSmooth paths on three-dimensional lattice.
A particular class of random walks with a spin factor on a three dimensional cubic lattice is studied. This three dimensional random walk model is a simple generalization of random walk for the two dimensional Ising model. All critical diffusion constants and associated critical exponents are calculated. Continuum field theories such as Klein-Gordon, Dirac and massive Chern-Simons theories are ...
متن کاملOn two-dimensional random walk among heavy-tailed conductances
We consider a random walk among unbounded random conductances on the two-dimensional integer lattice. When the distribution of the conductances has an infinite expectation and a polynomial tail, we show that the scaling limit of this process is the fractional kinetics process. This extends the results of the paper [BČ10] where a similar limit statement was proved in dimension d ≥ 3. To make thi...
متن کاملExcited Random Walk in Three Dimensions Has Positive Speed
Excited random walk is a model of a random walk on Z which, whenever it encounters a new vertex it receives a push toward a specific direction, call it the “right”, while when it reaches a vertex it “already knows”, it performs a simple random walk. This model has been suggested in [BW] and had since got lots of attention, see [V, Z]. The reason for the interest is that it is situated very natu...
متن کامل